Markov chains for random dynamical systems on p-adic trees
نویسنده
چکیده
We study Markovian and non-Markovian behaviour of stochastic processes generated by random dynamical systems on p-adic trees. In fact, such systems can be interpreted as stochastic neural networks operating on branches of the homogeneous p-adic tree (where p > 1 is a prime number). Key-Words: Random dynamical systems, p-adic numbers, Markovian property
منابع مشابه
On Markovian behaviour of p-adic random dynamical systems
We study Markovian and non-Markovian behaviour of stochastic processes generated by p-adic random dynamical systems. Given a family of p-adic monomial random mappings generating a random dynamical system. Under which conditions do the orbits under such a random dynamical system form Markov chains? It is necessary that the mappings are Markov dependent. We show, however, that this is in general ...
متن کاملOrderings of the rationals and dynamical systems
This paper is devoted to a systematic study of a class of binary trees encoding the structure of rational numbers both from arithmetic and dynamical point of view. The paper is divided into two parts. The first one is a critical review of rather standard topics such as SternBrocot and Farey trees and their connections with continued fraction expansion and the question mark function. In the seco...
متن کاملMarkov Chains and Dynamical Systems: the Open System Point of View *
This article presents several results establishing connections between Markov chains and dynamical systems, from the point of view of open systems in physics. We show how all Markov chains can be understood as the information on one component that we get from a dynamical system on a product system, when losing information on the other component. We show that passing from the deterministic dynam...
متن کاملOn the computation of invariant measures in random dynamical systems
Invariant measures of dynamical systems generated e. g. by difference equations can be computed by discretizing the originally continuum state space, and replacing the action of the generator by the transition mechanism of a Markov chain. In fact they are approximated by stationary vectors of these Markov chains. Here we extend this well known approximation result and the underlying algorithm t...
متن کاملA Contraction Theorem for Markov Chains on General State Spaces
Let {Xn, n = 0, 1, 2, ...} denote a Markov chain on a general state space and let f be a nonnegative function. The purpose of this paper is to present conditions which will imply that f(Xn) tends to 0 a.s., as n tends to infinity. As an application we obtain a result on synchronisation for random dynamical systems. At the end of the paper we also present a result on convergence in distribution ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000